Self-stabilized gradient algorithms for blind source separation with orthogonality constraints

نویسنده

  • Scott C. Douglas
چکیده

Recently, developments in self-stabilized algorithms for gradient adaptation of orthonormal matrices have resulted in simple but powerful principal and minor subspace analysis methods. In this paper, we extend these ideas to develop algorithms for instantaneous prewhitened blind separation of homogeneous signal mixtures. Our algorithms are proven to be self-stabilizing to the Stiefel manifold of orthonormal matrices, such that the rows of the adaptive demixing matrix do not need to be periodically reorthonormalized. Several algorithm forms are developed, including those that are equivariant with respect to the prewhitened mixing matrix. Simulations verify the excellent numerical properties of the proposed methods for the blind source separation task.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blind Source Separation Algorithms with Matrix Constraints

In many applications of Independent Component Analysis (ICA) and Blind Source Separation (BSS) estimated sources signals and the mixing or separating matrices have some special structure or some constraints are imposed for the matrices such as symmetries, orthogonality, non-negativity, sparseness and specified invariant norm of the separating matrix. In this paper we present several algorithms ...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information

Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...

متن کامل

A new non-orthogonal approximate joint diagonalization algorithm for blind source separation

A new algorithm for approximate joint diagonalization of a set of matrices is presented. Using a weighted leastsquares (WLS) criterion, without the orthogonality constraint, it is compared with an analoguous algorithm for blind source separation (BSS). The criterion of our algorithm is on the separating matrix while the other is on the mixing matrix. The convergence of our algorithm is proved u...

متن کامل

Blind source separation of instantaneous MIMO systems based on the least-squares Constant Modulus Algorithm

Blind symbol detection for mobile communications systems has been widely studied and can be implemented by using either adaptive or iterative techniques. However, adaptive blind algorithms require data of sufficient length to converge. Therefore, in a rapidly changing environment, they are likely unable to track the changing channels. In such a situation, one possible solution is to use iterati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on neural networks

دوره 11 6  شماره 

صفحات  -

تاریخ انتشار 2000